var BinaryTree = function(){
	var head;
	
	this.add = function(text){
		if(!head){
			head = new Node("a","z",text);
		} else {
			head.add(text);
		}
	}
};

var Node = function(valueFrom, valueTo, value){
	var left;
	var right;
	
	var from = valueFrom;
	var to = valueTo;
	
	var value;
	
	this.add = function(text){
		if(value){
			if(value < text){
				
			}
		}
	};
};

var stringToNumber = function(text){
	var number = 0;
	for(var i = text.length-1, j = 0; i >= 0; i--, j++){
		var a = text.toLowerCase().charCodeAt(i) - 96;
		number += a * Math.pow(26, j);
	}
	return number;
};

var numberToString = function(number){
	var text = "";
	while(number > 0){
		var rest = number % 26;
		text = String.fromCharCode(rest + 96) + text;
		number = Math.floor(number / 26);
	}
	return text;
};